Long DNA Sequence Comparison on Multicore Architectures
نویسندگان
چکیده
Biological sequence comparison is one of the most important tasks in Bioinformatics. Due to the growth of biological databases, sequence comparison is becoming an important challenge for high performance computing, especially when very long sequences are compared. The Smith-Waterman (SW) algorithm is an exact method based on dynamic programming to quantify local similarity between sequences. The inherent large parallelism of the algorithm makes it ideal for architectures supporting multiple dimensions of parallelism (TLP, DLP and ILP). In this work, we show how long sequences comparison takes advantage of current and future multicore architectures. We analyze two different SW implementations on the CellBE and use simulation tools to study the performance scalability in a multicore architecture. We study the memory organization that delivers the maximum bandwidth with the minimum cost. Our results show that a heterogeneous architecture is an valid alternative to execute challenging bioinformatic workloads.
منابع مشابه
Design of a novel congestion-aware communication mechanism for wireless NoC architecture in multicore systems
Hybrid Wireless Network-on-Chip (WNoC) architecture is emerged as a scalable communication structure to mitigate the deficits of traditional NOC architecture for the future Multi-core systems. The hybrid WNoC architecture provides energy efficient, high data rate and flexible communications for NoC architectures. In these architectures, each wireless router is shared by a set of processing core...
متن کاملTall and Skinny QR Matrix Factorization Using Tile Algorithms on Multicore Architectures
To exploit the potential of multicore architectures, recent dense linear algebra libraries have used tile algorithms, which consist in scheduling a Directed Acyclic Graph (DAG) of tasks of fine granularity where nodes represent tasks, either panel factorization or update of a block-column, and edges represent dependencies among them. Although past approaches already achieve high performance on ...
متن کاملThe Comparison of different Procedures for DNA extraction from paraffin-embedded Tissues: A commercial kit and a traditional method based on heating
Abstract Background and objectives: Paraffin-embedded tissues and clinical samples are a valuable resource for molecular genetic studies, but the extraction of high-quality genomic DNA from this tissues is still a problematic issue. In the Present study, the efficiency of two DNA extraction protocols, a commercial kit and a traditional method based on heating and K Proteinase was compared. Mate...
متن کاملEnhancing Parallelism of Tile QR Factorization for Multicore Architectures
To exploit the potential of multicore architectures, recent dense linear algebra libraries have used tile algorithms, which consist of scheduling a Directed Acyclic Graph (DAG) of fine granularity tasks where nodes represent tasks, either panel factorization or update of a block-column, and edges represent dependencies among them. Although past approaches already achieve high performance on mod...
متن کاملDna Compressed and Sequence Searching on Multicore
One of the used of string matching is to search DNA sequence in the DNA database. This simple operation can be done in hours or days, because the huge size of DNA sequence database. On the other hand, the potential of multicore for DNA sequence searching is not fully explored due to the difficulty of multicore programming. This paper evaluates several key string matching algorithms using a comp...
متن کامل